SHA-3 proposal BLAKE
نویسندگان
چکیده
BLAKE is our proposal for SHA-3. BLAKE entirely relies on previously analyzed components: it uses the HAIFA iteration mode and builds its compression function on the ChaCha core function. BLAKE resists generic second-preimage attacks, length extension, and sidechannel attacks. Theoretical and empirical security guarantees are given, against structural and differential attacks. BLAKE hashes on a Core 2 Duo at 12 cycles/byte, and on a 8-bit PIC microcontroller at 400 cycles/byte. In hardware BLAKE can be implemented in less than 9900 gates, and reaches a throughput of 6 Gbps. FHNW, Windisch, Switzerland, [email protected] ETHZ, Zürich, Switzerland, [email protected] FHNW, Windisch, Switzerland, [email protected] Loughborough University, UK, [email protected]
منابع مشابه
Indifferentiability of the Hash Algorithm BLAKE
The hash algorithm BLAKE, one of the SHA-3 finalists, was designed by Aumasson, Henzen, Meier, and Phan. Unlike other SHA-3 finalists, there is no known indifferentiable security proof on BLAKE. In this paper, we provide the indifferentiable security proof on BLAKE with the bound O( σ 2 2n−3 ), where σ is the total number of blocks of queries, and n is the hash output size.
متن کاملImplementation of Blake Algorithm Using Pipelining in Fpga
This paper proposes the Pipelined SHA-3 BLAKE algorithm, running on an FPGA with the intention of developing the optimization in FPGA for BLAKE algorithm. Secured hash algorithm-3(SHA-3) BLAKE algorithm is a family of cryptographic hash function published by the National Institute of Standards and Technology (NIST). To implement BLAKE algorithm we have utilized VHDL, where we introduce the pipe...
متن کاملSHA-3: The BLAKE Hash Function
A global competition is currently taking place to select a hash function which will become a new standard in the field of cryptography. The competition was announced in 2007 by the National Institute of Standards and Technology (NIST) to find a successor to its previous Secure Hash Algorithm (SHA) standards, SHA-1 and SHA-2. The submissions have been narrowed down to a set of five, judged by th...
متن کاملCompact Hardware Implementations of the SHA-3 Candidates ARIRANG, BLAKE, Gröstl, and Skein
The weakening of the widely used SHA-1 hash function has also cast doubts on the strength of the related algorithms of the SHA-2 family. The US NIST has therefore initiated the SHA-3 competition in order to select a modern hash function algorithm as a “backup” for SHA-2. This algorithm should be efficiently implementable both in software and hardware under different constraints. In this paper, ...
متن کاملNear-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, including Skein and BLAKE, both of which have components based on modular addition, rotation and bitwise XOR (ARX). In this paper, we propose improved near-collision attacks on the reduced-round compression functions ...
متن کامل